Cyclotomic factors of the descent set polynomial

نویسندگان

  • Denis Chebikin
  • Richard Ehrenborg
  • Pavlo Pylyavskyy
  • Margaret Readdy
چکیده

We introduce the notion of the descent set polynomial as an alternative way of encoding the sizes of descent classes of permutations. Descent set polynomials exhibit interesting factorization patterns. We explore the question of when particular cyclotomic factors divide these polynomials. As an instance we deduce that the proportion of odd entries in the descent set statistics in the symmetric group Sn only depends on the number on 1’s in the binary expansion of n. We observe similar properties for the signed descent set statistics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The descent set polynomial revisited

We continue to explore cyclotomic factors in the descent set polynomial Qn(t), which was introduced by Chebikin, Ehrenborg, Pylyavskyy and Readdy. We obtain large classes of factors of the form Φ2s or Φ4s where s is an odd integer, with many of these being of the form Φ2p where p is a prime. We also show that if Φ2 is a factor of Q2n(t) then it is a double factor. Finally, we give conditions fo...

متن کامل

O ct 2 00 8 Neighboring ternary cyclotomic coefficients differ by at most one

A cyclotomic polynomial Φn(x) is said to be ternary if n = pqr with p, q and r distinct odd prime factors. Ternary cyclotomic polynomials are the simplest ones for which the behaviour of the coefficients is not completely understood. Eli Leher showed in 2007 that neighboring ternary cyclotomic coefficients differ by at most four. We show that, in fact, they differ by at most one. Consequently, ...

متن کامل

Cyclotomic Solomon Algebras

This paper introduces an analogue of the Solomon descent algebra for the complex reflection groups of type G(r, 1, n). As with the Solomon descent algebra, our algebra has a basis given by sums of ‘distinguished’ coset representatives for certain ‘reflection subgroups’. We explicitly describe the structure constants with respect to this basis and show that they are polynomials in r. This allows...

متن کامل

Short, Invertible Elements in Partially Splitting Cyclotomic Rings and Applications to Lattice-Based Zero-Knowledge Proofs

When constructing practical zero-knowledge proofs based on the hardness of the RingLWE or the Ring-SIS problems over polynomial rings Zp[X]/(X + 1), it is often necessary that the challenges come from a set C that satisfies three properties: the set should be large (around 2), the elements in it should have small norms, and all the non-zero elements in the difference set C −C should be invertib...

متن کامل

Generalized reciprocals, factors of Dickson polynomials and generalized cyclotomic polynomials over finite fields

We give new descriptions of the factors of Dickson polynomials over finite fields in terms of cyclotomic factors. To do this generalized reciprocal polynomials are introduced and characterized. We also study the factorization of generalized cyclotomic polynomials and their relationship to the factorization of Dickson polynomials.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 116  شماره 

صفحات  -

تاریخ انتشار 2009